Some combinatorial questions about polynomial mappings
نویسندگان
چکیده
The purpose of this note is to show how recent progress in non-commutative combinatorial algebra gives a new input to Jacobian-related problems in a commutative situation. @ 1997 Elscvier Science B.V. 1991 Math. Subj. Class.: 13B2.5, 13810, 14A05
منابع مشابه
Kinematic Formulas for Finite Lattices
In analogy to valuation characterizations and kinematic formulas of convex geometry, we develop a combinatorial theory of invariant valuations and kinematic formulas for finite lattices. Combinatorial kinematic formulas are shown to have application to some probabilistic questions, leading in turn to polynomial identities for Möbius functions and Whitney numbers.
متن کامل0 M ay 2 00 4 Renormalizing iterated elementary mappings and correspondences of C 2 ∗
After proving a multi-dimensional extension of Zalcman’s renormalization lemma and considering maximality problems about dimensions, we find renormalizing polynomial families for iterated elementary mappings, extending this result to some kinds of correspondences (by means of ’algebraic’ renormalizing families) and to the family of the iterated mappings of an automorphism of C2 admitting a repu...
متن کاملRenormalizing Iterated Elementary Mappings and Correspondences of C
After proving a multi-dimensional extension of Zalcman’s renormalization lemma and considering maximality problems about dimensions, we find renormalizing polynomial families for iterated elementary mappings, extending this result to some kinds of correspondences (by means of ’algebraic’ renormalizing families) and to the family of the iterated mappings of an automorphism of C2 admitting a repu...
متن کاملThe Slope Polynomial and Collinear Points in Permutations
We consider a polynomial – which we term the “slope polynomial” – that encodes information about slopes of lines defined by a point-set in finite affine planes. When the aforementioned point-set is the graph of a permutation, we show that constancy of the polynomial is equivalent to the permutation being linear. This has immediate consequences for the structure of the 3-uniform hypergraph of co...
متن کاملCombinatorial Nullstellensatz Modulo Prime Powers and the Parity Argument
We present new generalizations of Olson’s theorem and of a consequence of Alon’s Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime powers. We analyze computational search problems corresponding to these kinds of combinatorial questions and we prove that the problem of finding degreeconstrain...
متن کامل